A two-subcycle thinning algorithm and its parallel implementation on SIMD machines
نویسندگان
چکیده
A new parallel thinning algorithm with two subcycles is proposed and compared with other parallel thinning algorithms in terms of 8-connectedness degree, erosion, stability under pattern rotation, and boundary noise sensitivity. Computational issues are also reported based on the implementation of the thinning algorithm on the SIMD machines CM-200 and MasPar MPP-12000.
منابع مشابه
A parallel algorithm for incremental stereo matching on SIMD machines
Previous matching algorithms have achieved high speeds through algorithm simplification and/or relied on custom hardware. The objective of our work has been the development a robust high-speed stereo matcher by exploiting parallel algorithms executing on general purpose SIMD machines. Our approach is based on several existing techniques dealing with the classification and evaluation of matches,...
متن کاملSolving the Problem of Scheduling Unrelated Parallel Machines with Limited Access to Jobs
Nowadays, by successful application of on time production concept in other concepts like production management and storage, the need to complete the processing of jobs in their delivery time is considered a key issue in industrial environments. Unrelated parallel machines scheduling is a general mood of classic problems of parallel machines. In some of the applications of unrelated parallel mac...
متن کاملSolving the Problem of Scheduling Unrelated Parallel Machines with Limited Access to Jobs
Nowadays, by successful application of on time production concept in other concepts like production management and storage, the need to complete the processing of jobs in their delivery time is considered a key issue in industrial environments. Unrelated parallel machines scheduling is a general mood of classic problems of parallel machines. In some of the applications of unrelated parallel mac...
متن کاملDerivation of Eecient Data Parallel Programs
This paper considers the expression and derivation of eecient data parallel programs for SIMD and MIMD machines. It is shown that eecient parallel programs must utilise both sequential and parallel computation; these are termed hybrid programs. The Bird{Meertens formalism, a calculus of higher order functions, is used to derive and express programs. Our goal is to derive eecient parallel progra...
متن کاملParallel Generation of t-ary Trees
A parallel algorithm for generating t-ary tree sequences in reverse B-order is presented. The algorithm generates t-ary trees by 0-1 sequences, and each 0-1 sequences is generated in constant average time O(1). The algorithm is executed on a CREW SM SIMD model, and is adaptive and cost-optimal. Prior to the discussion of the parallel algorithm a new sequential generation with O(1) average time ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
دوره 9 2 شماره
صفحات -
تاریخ انتشار 2000